Synthesis of cryptographic interleaved sequences by means of linear cellular automata
نویسندگان
چکیده
منابع مشابه
Synthesis of cryptographic interleaved sequences by means of linear cellular automata
This work shows that a class of pseudorandom binary sequences, the so-called interleaved sequences, can be generated by means of linear multiplicative polynomial cellular automata. In fact, these linear automata generate all the solutions of a type of linear difference equations with binary coefficients. Interleaved sequences are just particular solutions of such equations. In this way, popular...
متن کاملLinear Cellular Automata as Discrete Models for Generating Cryptographic Sequences
This work shows that a wide class of cryptographic sequences, the so-called interleaved sequences, can be generated by means of linear multiplicative polynomial cellular automata. In fact, this type of onedimensional linear 90/150 cellular automata can be devised as generators of pseudo-random sequences. Moreover, these linear automata generate all the solutions of a type of difference equation...
متن کاملRecovering decimation-based cryptographic sequences by means of linear CAs
The sequences produced by the cryptographic sequence generator known as the shrinking generator can be modelled as the output sequences of linear elementary cellular automata. These sequences are composed of interleaved m-sequences produced by linear structures based on feedback shifts. This profitable characteristic can be used in the cryptanalysis of this generator. In this work we propose an...
متن کاملGeneration of Cryptographic Sequences by means of Difference Equations
In the present work, it is shown that the sequences obtained from cryptographic generators based on decimation are just particular solutions of a kind of linear difference equations. Moreover, all these sequences are simple linear combinations of a class of basic sequences (binomial sequences). Cryptographic parameters of decimated sequences, e.g. period, linear complexity or balancedness, can ...
متن کاملOptimization of Quantum Cellular Automata Circuits by Genetic Algorithm
Quantum cellular automata (QCA) enables performing arithmetic and logic operations at the molecular scale. This nanotechnology promises high device density, low power consumption and high computational power. Unlike the CMOS technology where the ON and OFF states of the transistors represent binary information, in QCA, data is represented by the charge configuration. The primary and basic devic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 2009
ISSN: 0893-9659
DOI: 10.1016/j.aml.2009.03.018